The powerset operator on abstract interpretations
نویسندگان
چکیده
منابع مشابه
Improving Abstract Interpretations by Systematic Lifting to the Powerset
Operators that systematically produce more precise abstract interpretations from simpler ones are interesting. In this paper we present a formal study of one such operator: the powerset. The main achievements of the paper are described below: • A formal definition of the powerset operator is given. For any given abstract interpretation D = 〈D, o1, . . . , ok〉, where D is the abstract domain and...
متن کاملAbstract Counterexample-Based Refinement for Powerset Domains
Counterexample-based Refinement for Powerset Domains R. Manevich, J. Field , T. A. Henzinger, G. Ramalingam, and M. Sagiv 1 Tel Aviv University, {rumster,msagiv}@tau.ac.il 2 IBM T.J. Watson Research Center, [email protected] 3 EPFL, [email protected] 4 Microsoft Research India, [email protected] Abstract. Counterexample-guided abstraction refinement (CEGAR) is a powerful technique to scale auto...
متن کاملthe impact of using inspirational quotes on abstract vocabulary recall
the present study is an attempt to investigate the potential impact of inspirational quotes on improving english abstract vocabulary recall. to achieve this goal, a multiple choice language proficiency test of 60 items including vocabulary and grammar component was administered to a sample of 63 second-semester male and female students whose age ranged between 17 to 22 and they were studying en...
15 صفحه اولPOWERSET OPERATOR FOUNDATIONS FOR CATALG FUZZY SET THEORIES
The paper sets forth in detail categorically-algebraic or catalg foundations for the operations of taking the image and preimage of (fuzzy) sets called forward and backward powerset operators. Motivated by an open question of S. E. Rodabaugh, we construct a monad on the category of sets, the algebras of which generate the fixed-basis forward powerset operator of L. A. Zadeh. On the next step, w...
متن کاملAutomatically Refining Abstract Interpretations
Abstract interpretation techniques prove properties of programs by computing abstract fixpoints. All such analyses suffer from the possibility of false errors. We present three techniques to automatically refine such abstract interpretations to reduce false errors: (1) a new operator called interpolated widen, which automatically recovers precision lost due to widen, (2) a new way to handle dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00007-3